Construções hipotáticas oracionais aditivas de extensão (Extending additive hypotactic clausal constructions)
نویسندگان
چکیده
منابع مشابه
AspectH: Uma Extensão Orientada a Aspectos de Haskel
This paper presents an extension of the Haskell programming language with the objective of improving modularization of functional programs. This extension, AspectH, extends Haskell with aspect oriented concepts. AspectH implements Aspect-Oriented Programming (AOP) through pointcuts and advice, like in AspectJ, and was designed to be used in Haskell programs that use monads.
متن کاملExtensão do WEKA para Métodos de Agrupamento com Restrição de Contigüidade do Rio de Janeiro
Existem várias ferramentas que implementam os algoritmos clássicos de mineração de dados disponíveis no mercado, entretanto, a maioria delas são pagas ou não possuem código-aberto. As ferramentas que implementam algoritmos de mineração de dados em bases de dados espaciais são raras, acarretando a necessidade de desenvolvimento de novas ferramentas ou a implementação dos algoritmos de mineração ...
متن کاملLuar-X: extensão e generalização do sistema de processamento de modelos luar
The Luar template processing system used in authoring NCL documents, has development concepts based on reuse of descriptions through document templates. These development concepts can be used in the authorship of other XML-based documents through the analysis, adequacy, design and creation of a new reuse infrastructure based on Luar system. This view shows the processing system of models Luar-X...
متن کاملMore Constructions, More Genres: Extending Stanford Dependencies
The Stanford dependency scheme aims to provide a simple and intuitive but linguistically sound way of annotating the dependencies between words in a sentence. In this paper, we address two limitations the scheme has suffered from: First, despite providing good coverage of core grammatical relations, the scheme has not offered explicit analyses of more difficult syntactic constructions; second, ...
متن کاملOn extending de Bruijn sequences
An indirect proof of part of Theorem 1 was first given by Leach in [11] with a topological and measure-theoretic argument on the set of real numbers corresponding to limits of frequency distribution sequences. In [7] Flaxman et al. use the graph-theoretical characterization of de Bruijn sequences to show that the extensions always exist in alphabets with at least three symbols. However, their p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Estudos da Língua(gem)
سال: 2020
ISSN: 1982-0534,1808-1355
DOI: 10.22481/el.v18i1.6099